Comment on an algorithm that generates fuzzy prime implicants by Lee and Chang
نویسندگان
چکیده
منابع مشابه
On Kernel Rule's and Prime Implicants
We draw a simple correspondence between kernel rules and prime s’mphznts. Kernel (minimal) rules play an important role in many induction techniques. Prime implicants were previously used to formally model many other problem domains, including Boolean circuit minimization and such classical AI problems as diagnosis, truth maintenance and circumscription. This correspondence allows computing ker...
متن کاملPrime Implicants and Belief Update
Adaptation is one of the most important capabilities that an intelligent agent should present. In order to provide this capability to logical-based agents, the Belief Change area proposes methods to incorporate new information in a belief set. Properties like consistency and minimal change guide the change process. The notion of minimal change is usually associated with a closeness criterion ba...
متن کاملOn Computing Minimum Size Prime Implicants
In this paper we describe a new model and algorithm for computing minimum-size prime implicants of Boolean functions. The computation of minimum-size prime implicants has several applications in different areas, including Electronic Design Automation (EDA), Non-Monotonic Reasoning, Logical Inference, among others. For EDA, one significant and immediate application is the computation of minimum-...
متن کاملEvaluate Prime Implicants Description
data.logicfs Example Data of logicFS Description data.logicfs contains two objects: a simulated matrix data.logicfs of 400 observations (rows) and 15 variables (columns) and a vector cl.logicfs of length 400 containing the class labels of the observations. Each variable is categorical with realizations 1, 2 and 3. The first 200 observations are cases, the remaining are controls. If one of the f...
متن کاملWidening ROBDDs with Prime Implicants
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90319-7